A Convexity Measurement for Polygons
نویسندگان
چکیده
Convexity estimators are commonly used in the analysis of shape. In this paper we define and evaluate a new easily computable measure of convexity for polygons. Let be an arbitrary polygon. If denotes the perimeter in the sense of metrics of the polygon obtained by the rotation of by angle with the origin as the center of the applied rotation, and if is the Euclidean perimeter of the minimal rectangle having the edges parallel to coordinate axes which includes such a rotated polygon , then we show that defined as can be used as an estimate for the convexity of . Several desirable properties of are proved, as well.
منابع مشابه
Measuring Convexity via Convex Polygons
This paper describes a general approach to compute a family of convexity measures. Inspired by the use of geometric primitives (such as circles) which are often fitted to shapes to approximate them, we use convex polygons for this task. Convex polygons can be generated in many ways, and several are demonstrated here. These polygons are scaled and translated to ensure that they fit the input sha...
متن کاملConstant-Time Convexity Problems on Reconfigurable Meshes
The purpose of this paper is to demonstrate that the versatility of the reconngurable mesh can be exploited to devise constant-time algorithms for a number of important computational tasks relevant to robotics, computer graphics, image processing, and computer vision. In all our algorithms, we assume that one or two n-vertex (convex) polygons are pretiled, one vertex per processor, onto a recon...
متن کاملThree-dimensional strong convexity and visibility
We define the notions of strong convexity and strong visibility. These notions generalize standard convexity and visibility, as well as several types of nontraditional convexity, such as iso-oriented rectangles and C-oriented polygons. We explore the properties of strong convexity and strong visibility in two and three dimensions. In particular, we establish analogs of the following properties ...
متن کاملPerimeter generating functions for the mean-squared radius of gyration of convex polygons
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν = 1. PACS numbers: 05.50.+q, 05.70.Jk, 02.10.Ox
متن کاملOn k-convex polygons
We introduce a notion of k-convexity and explore polygons in the plane that have this property. Polygons which are k-convex can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. We give a characterization of 2-convex polygons, a particularly interesting class, and show how to recognize them in O(n log n) time. A description of their sh...
متن کامل